Universal statistics of the knockout tournament
نویسندگان
چکیده
We study statistics of the knockout tournament, where only the winner of a fixture progresses to the next. We assign a real number called competitiveness to each contestant and find that the resulting distribution of prize money follows a power law with an exponent close to unity if the competitiveness is a stable quantity and a decisive factor to win a match. Otherwise, the distribution is found narrow. The existing observation of power law distributions in various kinds of real sports tournaments therefore suggests that the rules of those games are constructed in such a way that it is possible to understand the games in terms of the contestants' inherent characteristics of competitiveness.
منابع مشابه
Efficient Simulation of a Random Knockout Tournament
We consider the problem of using simulation to efficiently estimate the win probabilities for participants in a general random knockout tournament. Both of our proposed estimators, one based on the notion of “observed survivals” and the other based on conditional expectation and post-stratification, are highly effective in terms of variance reduction when compared to the raw simulation estimato...
متن کاملOn the Agenda Control Problem for Knockout Tournaments
Knockout tournaments are very common in practice for various settings such as sport events and sequential pairwise elimination elections. In this paper, we investigate the computational aspect of tournament agenda control, i.e., finding the agenda that maximizes the chances of a target player winning the tournament. We consider several modelings of the problem based on different constraints tha...
متن کاملOn the complexity of schedule control problems for knockout tournaments
Knockout tournaments provide a common and important framework for structuring sporting competitions, worth billions of dollars every year in the global economy. Knockout tournaments also model a specific type of election scheme: namely, sequential pairwise elimination elections. The designer of a tournament typically controls both the shape of the tournament (usually a binary tree) and the seed...
متن کاملThe Optimal Design of Sporting Contests
The idea that Operational Research can be used to optimise the design of a sporting contest or tournament is a novel one. This paper considers a methodology for this purpose. We propose a number of tournament metrics that can be used to measure the success of a sporting contest or tournament, and describe how these metrics may be evaluated for a particular tournament design. Knowledge of these ...
متن کاملRobustness versus Performance in Sorting and Tournament Algorithms
In this paper we analyze the robustness of sorting and tournament algorithms against faulty comparisons. Sorting algorithms are differently affected by faulty comparisons depending on how comparison errors can affect the overall result. In general, there exists a tradeoff between the number of comparisons and the accuracy of the result, but some algorithms like Merge Sort are Pareto-dominant ov...
متن کامل